/* Bibliography for texts related to graph drawing. */

@article{DiBattista1994,
    author = {G. D. Battista and P. Eades and R. Tamassia and I. G. Tollis},
    title = "{Algorithms for Drawing Graphs: an Annotated Bibliography}",
    journal = {Computational Geometry: Theory and Applications},
    volume = {4},
    number = {5},
    pages = {235-282},
    year = {1994}
}

@article{DiBattista1997,
  author = "Giuseppe Di Battista and Ashim Garg and Giuseppe Liotta and Roberto Tamassia and Emanuele Tassinari and Francesco Vargiu",
  title = "{An Experimental Comparison of Four Graph Drawing Algorithms}",
  journal = "Computational Geometry",
  volume = "7",
  number = "5-6",
  pages = "303-325",
  year = "1997",
  note = "11th ACM Symposium on Computational Geometry",
  issn = "0925-7721",
  doi = "DOI: 10.1016/S0925-7721(96)00005-3",
  url = "http://www.sciencedirect.com/science/article/B6TYS-3SNV32D-3/2/be27fc37f751488ce2ba62ce93217b5b"
}

@inproceedings{Eades1984,
    author = {Eades, P. A.},
    booktitle = {Congressus Numerantium},
    pages = {149-160},
    title = "{A Heuristic for Graph Drawing}",
    volume = {42},
    year = {1984}
}

@article{Davidson1996,
 author = {Davidson, Ron and Harel, David},
 title = "{Drawing Graphs Nicely Using Simulated Annealing}",
 journal = {ACM Transactions on Graphics},
 volume = {15},
 number = {4},
 year = {1996},
 issn = {0730-0301},
 pages = {301-331},
 doi = {http://doi.acm.org/10.1145/234535.234538},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@article{Johnson1982,
 title = "{The NP-Completeness Column: An Ongoing Guide}",
 journal = "Journal of Algorithms",
 volume = "3",
 number = "1",
 pages = "89-99",
 year = "1982",
 author = "David S. Johnson"
 }

@article{Johnson1984,
  title = "{The NP-Completeness Column: An Ongoing Guide}",
  journal = "Journal of Algorithms",
  volume = "5",
  number = "2",
  pages = "147-160",
  year = "1984",
  author = "David S. Johnson"
}

@article{Garey1983,
  author = {M. R. Garey and D. S. Johnson},
  title = "{Crossing Number is NP-Complete}",
  publisher = {SIAM},
  year = {1983},
  journal = {SIAM Journal on Algebraic and Discrete Methods},
  volume = {4},
  number = {3},
  pages = {312-316},
  url = {http://link.aip.org/link/?SML/4/312/1},
  doi = {10.1137/0604033}
}

@inproceedings{Lipton1985,
 author = {Lipton, R. J. and North, S. C. and Sandberg, J. S.},
 title = "{A Method for Drawing Graphs}",
 booktitle = {SCG '85: Proceedings of the First Annual Symposium on Computational Geometry},
 year = {1985},
 isbn = {0-89791-163-6},
 pages = {153-160},
 location = {Baltimore, Maryland, United States},
 doi = {http://doi.acm.org/10.1145/323233.323254},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@mastersthesis{Tunkelang1992,
 author = "D. Tunkelang",
 title = "{An Aesthetic Layout Algorithm for Undirected Graphs}",
 school = "Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology",
 year = "1992"
}

@article{Cai1993,
  author = {Jiazhen Cai and Xiaofeng Han and Robert E. Tarjan},
  title = "{An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem}",
  publisher = {SIAM},
  year = {1993},
  journal = {SIAM Journal on Computing},
  volume = {22},
  number = {6},
  pages = {1142-1162},
  url = {http://link.aip.org/link/?SMJ/22/1142/1},
  doi = {10.1137/0222068}
}

@techreport{Ferrari1969,
  author = {D. Ferrari and L. Mezzalira},
  title = "{On Drawing a Graph With the Minimum Number of Crossings}",
  institution = {Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano},
  year = {1969},
  number = {69}
}

@inproceedings{Eades1993,
  author = "Peter Eades and C. X. Mendon\c{c}a",
  title = "{Heuristics for Planarization by Vertex Splitting}",
  year = {1993},
  booktitle = {Proceedings of the ALCOM International Workshop on Graph Drawing}
}

@article{Tamassia1988,
    author = "R. Tamassia and G. Di Battista and C. Batini",
    title = "{Automatic Graph Drawing and Readability of Diagrams}",
    journal = "IEEE Transactions on Systems, Man and Cybernetics",
    volume= "SMC-18",
    number = "1",
    pages = {61-79},
    year = {1988}
}

@inproceedings{Batini1984,
    author = {C. Batini and E. Nardelli and M. Talamo and R. Tamassia},
    title = "{A Graphtheoretic Approach to Aesthetic Layout of Information Systems Diagrams}",
    year = {1984},
    booktitle = {10th International Workshop on Graphtheoretic Concepts in Computer Science},
    pages = {9-18},
    addresss = {Berlin}
}

@techreport{Garg1994,
    author = {A. Garg and R. Tamassia},
    title = "{On the Computational Complexity of Upward and Rectilinear Planarity Testing}",
    institution = {Deptartment of Computer Science, Brown University},
    year = {1994},
    number = {CS-94-10}
}

@article{Hopcroft1974,
    author = {J. Hopcroft and R. E. Tarjan},
    title = "{Efficient Planarity Testing}",
    year = {1974},
    journal = {Journal of the ACM},
    volume = {21},
    number = {4},
    pages = {549-568}
}

@article{Deo1976,
    author = "N. Deo",
    title = "{Note on Hopcroft and Tarjan's Planarity Algorithm}",
    journal = {Journal of the ACM},
    year = {1976},
    volume = {23},
    number = {1},
    pages = {74-75}
}

@article{Booth1976,
    author = "K. Booth and G. Luecker",
    title = "{Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms}",
    journal = "Journal of Computer and System Sciences",
    volume = {13},
    pages = {335-379},
    year = {1976}
}

@article{Chiba1985,
 author = {Chiba, Norishige and Nishizeki, Takao and Abe, Shigenobu and Ozawa, Takao},
 title = {A linear algorithm for embedding planar graphs using PQ-trees},
 journal = {Journal of Computer and System Sciences},
 volume = {30},
 number = {1},
 year = {1985},
 issn = {0022-0000},
 pages = {54-76},
 doi = {http://dx.doi.org/10.1016/0022-0000(85)90004-2},
 publisher = {Academic Press, Inc.},
 address = {Orlando, FL, USA},
}

@article{Wagner1936,
    author = {K. Wagner},
    title = "{Bemerkungen zum Vierfarbenproblem}",
    journal = {Jahresbericht der Deutschen Mathematiker-Vereinigung},
    volume = {46},
    pages = {26-32},
    year = {1936}
}

@article{Fary1948,
    author = "I. Fary",
    title = "{On Straight Lines Representation of Planar Graphs}",
    journal = {Acta Scientiarum Mathematicarum},
    volume = {11},
    pages = {229-233},
    year = {1948}
}

@article{Stein1951,
    author = {S. K. Stein},
    title = "{Convex Maps}",
    journal = {Proceedings of the American Mathematical Society},
    volume = {2},
    pages = {464-466},
    year = {1951}
}

@article{Tutte1960,
    author = {W. T. Tutte},
    title = "{Convex Representations of Graphs}",
    journal = {Proceedings of the London Mathematical Society},
    volume = {10},
    pages = {304-320},
    year = {1960}
}

@article{Thomassen1980,
    author = {C. Thomassen},
    title = "{Planarity and Duality of Finite and Infinite Planar Graphs}",
    journal = {Journal of Combinatorial Theory, Series B},
    volume = {29},
    pages = {244-271},
    year = {1980}
}

@inproceedings{Chiba1984,
    author = {N. Chiba and T. Yamanouchi and T. Nishizeki},
    title = "{Linear Algorithms for Convex Drawings of Planar Graphs}",
    booktitle = {Progress in Graph Theory},
    editor = {J. A. Bondy and U. S. R. Murty},
    pages = {153-173},
    publisher = {Academic Press},
    year = {1984}
}

@article{Becker1987,
    author = {B. Becker and G. Hotz},
    title = "{On the Optimal Layout of Planar Graphs with Fixed Boundary}",
    journal = {SIAM Journal on Computing},
    volume = {16},
    number = {5},
    pages = {946-972},
    year = {1987}
}

@article{Eades1990,
    author = {P. Eades and N. Wormald},
    title = "{Fixed Edge Length Graph Drawing is NP-hard}",
    journal = {Discrete Applied Mathematics},
    volume = {28},
    pages = {111-134},
    year = {1990}
}

@article{Duchet1983,
    author = {P. Duchet and Y. Hamidoume and M. Las Vergnas and H. Meyniel},
    title = "{Representing a Planar Graph by Vertical Lines Joining Different Levels}",
    journal = {Discrete Mathematics},
    volume = {46},
    pages = {319-321},
    year = {1983}
}

@inproceedings{Schlag1985,
    author = {M. Schlag and F. Luccio and P. Maestrini and D. T. Lee and C. K. Wong},
    title = "{A Visibility Problem in VLSI Layout Compaction}",
    booktitle = {Advances in Computing Research},
    editor = {F. P. Preparata},
    pages = {259-282},
    volume = {2},
    publisher = {JAI Press Inc.},
    address = {Greenwich, CT},
    year = {1985}
}

@article{Tamassia1986,
    author = {R. Tamassia and I. G. Tollis},
    title = "{A Unified Approach to Visibility Representations of Planar Graphs}",
    journal = {Discrete and Computational Geometry},
    volume = {1},
    number = {4},
    pages = {321-341},
    year = {1986}
}

@techreport{Fraysseix1993,
    author = {H. de Fraysseix and P. O. de Mendez and P. Rosenstiehl},
    title = "{Bipolar Orientations Revisited}",
    number = {P089},
    institution = {Centre d'Analyse et de Mathematique Sociales, Ecoles des Hautes Etudes en Sciences Sociales},
    address = {Paris},
    year = {1993}
}

@techreport{Jones1991,
    author = {S. Jones and P. Eades and A. Moran and N. Ward and G. Delott and R. Tamassia},
    title = "{A Note on Planar Graph Drawing Algorithms}",
    number = {216},
    institution = {Deptartment of Computer Science, University of Queensland},
    year = {1991}
}

@article{Ozawa1980,
    author = {T. Ozawa},
    title = "{Planarity Testing for IC Layout with Constraints for Pin Order and Congestion Between Pins}",
    journal = {IEEE Conference Record of the 14th Asimolar Conference on Circuits, Systems Computers},
    pages = {188-192},
    year = {1980}
}

@techreport{Kant1992,
    author = {G. Kant},
    title = "{Hexagonal Grid Drawings}",
    number = {RUU-CS-92-06},
    institution = {Department of Computer Science, Utrecht University},
    year = {1992}
}

@article{Bhasker1988,
    author = {J. Bhasker and S. Sahni},
    title = "{A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph}",
    journal = {Algorithmica},
    volume = {3},
    number= {2},
    pages = {247-278},
    year = {1988}
}

@article{Tamassia1989,
    author = {R. Tamassia and I. G. Tollis},
    title = "{Tessellation Representations of Planar Graphs}",
    journal = {Proceedings of the 27th Annual Allerton Conference},
    pages = {48-57},
    year = {1989}
}

@article{DiBattista1988,
    author = {G. D. Battista and R. Tamassia},
    title = "{Algorithms for Plane Representations of Acyclic Digraphs}",
    journal = {Theoretical Computer Science},
    volume = {61},
    pages = {175-198},
    year = {1988}
}

@inbook{Jurgensen1983,
    author = {H. J\"{u}rgensen and J. Loewer},
    title = "{Drawing Hasse Diagrams of Partially Ordered Sets}",
    booktitle = {Orthomodular Lattices},
    editor = {G. Kalmbach},
    pages = {331-345},
    year = {1983},
    publisher = {Academic Press},
    address = {London}
}

@article{Thomassen1989,
    author = {C. Thomassen},
    title = "{Planar Acyclic Oriented Graphs}",
    journal = {Order},
    volume = {5},
    number = {4},
    year = {1989},
    pages = {349-361}
}

@article{DiBattista1990,
    author = {G. D. Battista and W. P. Liu and I. Rival},
    title = "{Bipartite Graphs, Upwards Drawings, and Planarity}",
    journal = {Information Processing Letters},
    volume = {36},
    pages = {317-322},
    year = {1990}
}

@article{Tamassia1990,
    author = {R. Tamassia},
    title = "{Drawing Algorithms for Planar st-Graphs}",
    journal = {Australasian Journal of Combinatorics},
    volume = {2},
    pages = {217-235},
    year = {1990}
}

@article{Sugiyama1981,
    author = {K. Sugiyama and S. Tagawa and M. Toda},
    title = "{Methods for Visual Understanding of Hierachical Systems}",
    journal = {IEEE Transactions on Systems, Man, and Cybernetics},
    volume = {SMC-11},
    number = {2},
    pages = {109-125},
    year = {1981}
}

@phdthesis{Lin1992,
    author = {X. Lin},
    title = "{Analysis of Algorithms for Drawing Graphs}",
    school = {Deptartment of Computer Science, University of Queensland},
    year = {1992}
}

@article{Frank1981,
    author = {A. Frank},
    title = "{How to Make a Digraph Strongly Connected}",
    journal = {Combinatorica},
    volume = {1},
    number = {2},
    year = {1981}
}

@inproceedings{Berger1990,
    author = {B. Berger and P. Shor},
    title = "{Approximation Algorithms for the Maximum Acyclic Subgraph Problem}",
    booktitle = {Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms},
    pages = {236-243},
    year = {1990}
}

@article{Fruchterman1991,
    author = {Thomas M. J. Fruchterman and Edward M. Reingold},
    title = "{Graph Drawing by Force-directed Placement}",
    journal = {Software -- Practice and Experience},
    volume = {21},
    number = {11},
    pages = {1129-1164},
    year = {1991}
}

@inproceedings{Purchase1997,
    author = {Helen Purchase},
    title = "{Which Aesthetic has the Greatest Effect on Human Understanding?}",
    booktitle = {GD '97: Proceedings of the 5th International Symposium on Graph Drawing},
    series = {Lecture Notes in Computer Science},
    volume = {1353},
    publisher = {Springer Verlag},
    address = {Berlin/Heidelberg},
    isbn = {978-3-540-63938-1},
    year = {1997},
    pages = {248-261}
}

@article{Dickerson2005,
    author = {Matthew Dickerson and David Eppstein and Michael T. Goodrich and Jeremy Meng},
    title = "{Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way}",
    journal = {Journal of Graph Algorithms and Applications (special issue for GD'03)},
    volume = {9},
    number = {1},
    pages = {31-52},
    year = {2005}
}

@article{Herman2000,
    author = {Ivan Herman and Guy Melan\c{c}on and M. Scott Marshall},
    title = "{Graph Visualization and Navigation in Information Visualization: a Survey}",
    journal = {IEEE Transactions on Visualization and Computer Graphics},
    volume = {6},
    number = {10},
    pages = {24-43},
    year = {2000}
}

@inproceedings{Purchase2001,
    author = {Purchase, Helen C and McGill, Matthew and Colpoys, Linda and Carrington, David},
    title = "{Graph Drawing Aesthetics and the Comprehension of UML Class Diagrams: an Empirical Study}",
    booktitle = {APVis '01: Proceedings of the 2001 Asia-Pacific Symposium on Information Visualisation},
    year = {2001},
    isbn = {0-909925-87-9},
    pages = {129-137},
    location = {Sydney, Australia},
    publisher = {Australian Computer Society, Inc.},
    address = {Darlinghurst, Australia, Australia}
}

@inproceedings{Purchase2010,
    author = {Helen Purchase and Beryl Plimmer and Rosemary Baker and Cristopher Pilcher},
    title = "{Graph Drawing Aesthetics in User-Sketched Graph Layouts}",
    booktitle = {11th Australasian User Interface Conference (AUIC 2010)},
    series = {Conferences in Research and Practice in Information Technology},
    year = {2010},
    pages = {80-88},
    volume = {106},
    editor = {P. Calder and C. Lutteroth},
    location = {Brisbane, Australia}
}

@article{Kamada1988,
    author = "Tomihisa Kamada and Satoru Kawai",
    title = "{An Algorithm for Drawing General Undirected Graphs}",
    journal = "Information Processing Letters",
    volume = "31",
    number = "1",
    pages = "7-15",
    year = "1988",
    issn = "0020-0190",
    doi = "DOI: 10.1016/0020-0190(89)90102-6",
    url = "\url{http://www.sciencedirect.com/science/article/B6V0F-48CP4C8-4/2/e6715f311182e02253939e6d08018ac9}"
}

@inproceedings{Gansner2004,
    author = "Emden R. Gansner, Yehuda Koren and Stephen North",
    title = "{Graph Drawing by Stress Majorization}",
    year = "2004",
    booktitle = "Graph Drawing: 12th Internation Symposium, GD 2004",
    series = "{Lecture Notes in Computer Science}",
    volume = "3383",
    pages = {239-250},
    editor = {J. Pach},
    location = {Springer-Verlag Berlin Heidelberg}
}

@inproceedings{Six1999,
    author = "Janet M. Six and Ioannis G. Tollis",
    title = "{A Framework for Circular Drawings of Networks}",
    year = "1999",
    booktitle = "Graph Drawing '99",
    series = "Lecture Notes in Computer Science",
    volume = "1731",
    pages = "107-116",
    editor = "J. Kratochv\'il",
    location = {Springer-Verlag Berlin Heidelberg}
}

@inproceedings{Civril2005,
    author = "Ali Civril and Malik Magdon-Ismail and Eli Bocek-Rivele",
    title = "{SDE: Graph Drawing Using Spectral Distance Embedding}",
    year = "2005",
    booktitle = "GD 2005",
    series = "Lecture Notes in Computer Science",
    volume = "3843",
    pages = "512-513",
    editor = "P. Healy and N. S. Nikolov",
    location = {Springer-Verlag Berlin Heidelberg}
}

@inproceedings{Holten2009,
    author = {Holten, Danny and van Wijk, Jarke J.},
    title = "{A User Study on Visualizing Directed Edges in Graphs}",
    booktitle = "{Chi '09: Proceedings of the 27Th International Conference on Human Factors in Computing Systems}",
    year = {2009},
    isbn = {978-1-60558-246-7},
    pages = {2299-2308},
    location = {Boston, MA, USA},
    doi = {http://doi.acm.org/10.1145/1518701.1519054},
    publisher = {ACM},
    address = {New York, NY, USA},
}

@article{Ware2008,
    author = {Ware, Colin and Mitchell, Peter},
    title = "{Visualizing Graphs in Three Dimensions}",
    journal = {ACM Transactions on Applied Perception},
    volume = {5},
    number = {1},
    year = {2008},
    issn = {1544-3558},
    pages = {1--15},
    doi = {http://doi.acm.org/10.1145/1279640.1279642},
    publisher = {ACM},
    address = {New York, NY, USA}
}

# http://www.csse.monash.edu.au/hons/se-projects/2006/Kieran.Simpson/output/html/node9.html

# D. Harel and Y. Koren, “A Fast Multi-Scale Method for Drawing Large Graphs”, Journal of Graph Algorithms and Applications 6 (2002), pp. 179–202.
# F.J. Brandenburg, M. Himsolt and C. Rohrer, “An Experimental Comparison of Force- Directed and Randomized Graph Drawing Algorithms”, Proceedings of Graph Drawing ’95, LNCS 1027, pp. 76–87, Springer Verlag, 1995.